Tiling the plane without supersymmetry

نویسندگان

  • Bazeia
  • Brito
چکیده

We present a way of tiling the plane with a regular hexagonal network of defects. The network is stable and follows in consequence of the three-junctions that appear in a model of two real scalar fields that presents Z3 symmetry. The Z3 symmetry is effective in both the vacuum and defect sectors, and no supersymmetry is required to build the network.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polygonal tiling of some surfaces containing fullerene molecules

A tiling of a surface is a decomposition of the surface into pieces, i.e. tiles, which cover it without gaps or overlaps. In this paper some special polygonal tiling of sphere, ellipsoid, cylinder, and torus as the most abundant shapes of fullerenes are investigated.

متن کامل

A hierarchical strongly aperiodic set of tiles in the hyperbolic plane

We give a new construction of strongly aperiodic set of tiles in H, exhibiting a kind of hierarchical structure, simplifying the central framework of Margenstern’s proof that the Domino problem is undecidable in the hyperbolic plane [13]. Ludwig Danzer once asked whether, in the hyperbolic plane, where there are no similarities, there could be any notion of hierarchical tiling—an idea which pla...

متن کامل

Ecole Normale Supérieure de Lyon

We study some decision problems concerning the tiling of the plane with Wang tiles We present a proof for the undecidability of the tiling problem for the whole plane and also for the periodic tiling In these poofs an aperiodic tile set is constructed We are interested in the second part in the link between the cardinality of possible tilings of the plane with a given tile set and the existence...

متن کامل

Borel Sets and Countable Models

We show that certain families of sets and functions related to a countable structure A are analytic subsets of a Polish space. Examples include sets of automorphisms, endomorphisms and congruences of A and sets of the combinatorial nature such as coloring of countable plain graphs and domino tiling of the plane. This implies, without any additional set-theoretical assumptions, i.e., in ZFC alon...

متن کامل

Squaring and Not Squaring One or More Planes

A set of natural numbers tiles the plane if a square-tiling of the plane exists using exactly one square of sidelength n for every n in the set. In [9] it is shown that N, the set of all natural numbers, tiles the plane. We answer here a number of questions from that paper. We show that there is a simple tiling of the plane (no nontrivial subset of squares forms a rectangle). We show that neith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Physical review letters

دوره 84 6  شماره 

صفحات  -

تاریخ انتشار 2000